Supporting Fault-Tolerant Real-Time Applications Using the RED-Linux General Scheduling Framework
نویسندگان
چکیده
In this paper, we study the fault-tolerant support for realtime applications. In particular, we study the scheduling issues and kernel support for fault monitors and the primary-backup task model. Using the powerful scheduling framework in RED-Linux, we can support a jitterless fault monitoring. We can also provide the task execution isolation so that an erroneous runaway task will not take away additional CPU budget from other concurrently running tasks. Finally, we provide a group mechanism to allow the primary and backup jobs of a fault-tolerant task to share both the CPU budget as well as other resources. All these mechanisms make the implementation of fault-tolerant real-time systems easier.
منابع مشابه
Implementing a General Real-Time Scheduling Framework in the RED-Linux Real-Time Kernel
Many scheduling paradigms have been studied for realtime applications and real-time communication network. Among them, the most commonly used paradigms include priority-driven, time-driven and share-driven paradigms. In this paper, we present a general scheduling framework which is designed to integrate these paradigms in one framework. The framework is implemented in our real-time extension of...
متن کاملThe design and implementation of real-time schedulers in RED-linux
Researchers in the real-time system community have designed and studied many advanced scheduling algorithms. However, most of these algorithms have not been implemented since it is very difficult to support new scheduling algorithms on most operating systems. To address this problem, we enhance the scheduling mechanism in Linux to provide a flexible scheduling framework. In the real-time and em...
متن کاملA new scheduling approach supporting different fault-tolerant techniques for real-time multiprocessor systems
Many time-critical applications require predictable performance and tasks in these applications have deadlines to be met even in the presence of faults. Three diierent approaches have evolved for fault-tolerant scheduling of real-time tasks in multiprocessor systems-Triple Modular Redundancy (TMR), Primary Backup (PB), and Imprecise Computation (IC). In TMR approach, the fault detection is by v...
متن کاملProbabilistic Scheduling Guarantees for Fault-Tolerant Real-Time Systems
Hard real-time systems are usually required to provide an absolute guarantee that all tasks will always complete by their deadlines. In this paper we address fault tolerant hard real-time systems, and introduce the notion of a probabilistic guarantee. Schedulability analysis is used together with sensitivity analysis to establish the maximum fault frequency that a system can tolerate. The fault...
متن کاملAnalysis of Selective Fault - Tolerant , Hard Real - Time
An increasing number of applications are demanding real-time performance from their multiprocessor systems. For many of these applications, a failure may produce disastrous results. Such failures are avoided in hard real-time systems by the use of fault-tolerance. In hard real-time multiprocessor scheduling, this fault tolerance may be provided by including several task backups in each schedule...
متن کامل